Unsupervised Clustering using Metric Space Connectedness

نویسندگان

  • Iead A. Rezek
  • Stephen J. Roberts
چکیده

In metric space theory connectedness can be described in terms of a mapping of sets onto the real axis. This function is essentially a labelling function which clustering methods approximate. With the use of metric space theory a proposition and a conjecture are given which are implemented to perform unsupervised clustering which lacks many of the limitations of other, model-based, methods.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unsupervised Image Segmentation Based on Fuzzy Connectedness with Sale Space Theory

In this paper, we propose an approach of unsupervised segmentation with fuzzy connectedness. Valid seeds are first specified by an unsupervised method based on scale space theory. A region is then extracted for each seed with a relative object extraction method of fuzzy connectedness. Afterwards, regions are merged according to the values between them of an introduced measure. Some theorems and...

متن کامل

Image Clustering with Metric, Local Linear Structure, and Affine Symmetry

This paper addresses the problem of clustering images of objects seen from different viewpoints. That is, given an unlabelled set of images of n objects, we seek an unsupervised algorithm that can group the images into n disjoint subsets such that each subset only contains images of a single object. We formulate this clustering problem under a very broad geometric framework. The theme is the in...

متن کامل

Unsupervised distance metric learning using predictability

Distance-based learning methods, like clustering and SVMs, are dependent on good distance metrics. This paper does unsupervised metric learning in the context of clustering. We seek transformations of data which give clean and well separated clusters where clean clusters are those for which membership can be accurately predicted. The transformation (hence distance metric) is obtained by minimiz...

متن کامل

Unsupervised fuzzy clustering using weighted incremental neural networks

A new more efficient variant of a recently developed algorithm for unsupervised fuzzy clustering is introduced. A Weighted Incremental Neural Network (WINN) is introduced and used for this purpose. The new approach is called FC-WINN (Fuzzy Clustering using WINN). The WINN algorithm produces a net of nodes connected by edges, which reflects and preserves the topology of the input data set. Addit...

متن کامل

Adaptive Clustering by Analysis of the Connectedness Degree. Application to Skin Segmentation

The paper presents a spatio-color classification in a chrominanceluminance space related to the dichromatic model. The unsupervised adaptive clustering is performed after the color connectedness degrees (CCD) of a color interval which embeds jointly 1) colorimetric information; 2) the probability that a given color is connected (in the image) to a set of similar colors. The chrominance CCDs are...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997